Reasoning with Powerdomains in Isabelle/HOLCF
نویسنده
چکیده
This paper presents the first fully-mechanized formalization of powerdomains, implemented in the HOLCF logic of the Isabelle theorem prover. The powerdomain library provides an abstract view of powerdomains to the user, hiding the complicated implementation details. The library also provides proof automation, in the form of sets of rewrite rules for solving equalities and inequalities on powerdomains.
منابع مشابه
Holcf=hol+lcf
HOLCF is the de nitional extension of Church s Higher Order Logic with Scott s Logic for Computable Functions that has been implemented in the theorem prover Isabelle This results in a exible setup for reasoning about functional programs HOLCF supports stan dard domain theory in particular xpoint reasoning and recursive domain equations but also coinductive arguments about lazy datatypes This p...
متن کاملHigher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a way that one may use any theory defined in Isabelle/HOLCF to construct assertions, e.g., primitive recursion, least or greatest fixed points etc. The higher-order logic ensures that we can show non-trivial algorithms ...
متن کاملHOLCF ’11: A Definitional Domain Theory for Verifying Functional Programs
HOLCF is an interactive theorem proving system that uses the mathematics of domain theory to reason about programs written in functional programming languages. This thesis introduces HOLCF ’11, a thoroughly revised and extended version of HOLCF that advances the state of the art in program verification: HOLCF ’11 can reason about many program definitions that are beyond the scope of other forma...
متن کاملCertified HLints with Isabelle/HOLCF-Prelude
We present the HOLCF-Prelude, a formalization of a large part of Haskell’s standard prelude in Isabelle/HOLCF. Applying this formalization to the hints suggested by HLint allows us to certify them formally. In pure functional languages such as Haskell, equational reasoning is a valuable tool for refactoring, to improve both efficiency and aesthetics. For example, an experienced programmer would...
متن کاملHOLCF: Higher Order Logic of Computable Functions
This paper presents a survey of HOLCF a higher order logic of computable functions The logic HOLCF is based on HOLC a variant of the well known higher order logic HOL which o ers the additional concept of type classes HOLCF extends HOLC with concepts of domain theory such as complete partial orders continuous functions and a xed point operator With the help of type classes the extension can be ...
متن کامل